package com.huawei.leetcode;

import java.util.ArrayList;
import java.util.List;

/**
 * @Author: liu.cheng.su
 * @Time: 2023/12/12 0012 20:27
 * @Description:
 */
public class Code1631 {



    public static void main(String[] args) {
        Code1631 code1631 = new Code1631();
        int[][] heights = {{1, 2, 2}, {3, 8, 2}, {5, 3, 5}};
        code1631.minimumEffortPath(heights);
    }


    public int minimumEffortPath(int[][] heights) {
        int minV = 0;
        int rows = heights.length;
        int columns = heights[0].length;
        int i = 0;
        int j = 0;
        int lastNum = heights[i][j];




        return minV;
    }



    private boolean couldRight(int columns, int j) {
        return j < columns;
    }

    private boolean couldDown(int heights, int i) {
        return i < heights;
    }

    private int nextRight(int[][] heights, int columns, int i, int j) {
        if (couldRight(columns, j)) {
            return heights[i][j + 1];
        }
        throw new RuntimeException();
    }

    private int nextDown(int[][] heights, int columns, int i, int j) {
        if (couldDown(columns, j)) {
            return heights[i + 1][j];
        }
        throw new RuntimeException();
    }
}
